求复杂网络节点之间的最短距离，也叫做测地线，对复杂网络的拓扑性质的分析很重要-Complex networks seeking the shortest distance between nodes, also called geodesic network topological properties of complex analysis is very important

迪杰斯特拉算法求最短路径距离，可用于流形测地距离计算中。(Dijkstra algorithm for the shortest path distance, can be used for manifold geodesic distance calculation.)

matlab code for fastmarching to compute geodesic distance between two points of 3D model